Memory device and programming method thereof

ABSTRACT

A programming method for a memory device includes simultaneously starting to program a first plane and a second plane; and bypassing the first plane and keeping programming the second plane when the first plane has been programmed successfully and the second plane has not been programmed successfully yet.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a bypass continuation of International Application No. PCT/CN2020/086332 filed on Apr. 23, 2020, which is incorporated herein by reference in its entirety.

BACKGROUND OF THE INVENTION 1. Field of the Invention

The present invention is related to a memory device and programming method thereof, and more particularly, to a memory device and programming method thereof for eliminating programming disturbance.

2. Description of the Prior Art

Recently, the field of semiconductor memory has received increased attention. Semiconductor memory may be volatile or nonvolatile. A nonvolatile semiconductor memory device can retain data even when not powered and therefore has been used extensively in cellular telephones, digital cameras, personal digital assistants, mobile computing devices, non-mobile computing devices and other devices.

A memory device may be classified into a single-plane type and a multi-plane type in accordance with structural configuration of memory arrays. The single-plane type memory device includes memory arrays arranged into a single plane, and the multi-plane type memory device includes memory arrays arranged into a plurality of planes. When programming the multi-plane type memory device, two or more planes may be programmed and verified simultaneously according a multi-plane programming scheme to enhance programming efficiency. However, when the multi-plane type memory device contains defective planes (or degenerated planes), both the normal planes and the defective planes (or the degenerated planes) will be repeatedly programmed in an attempt to program data into the defective planes (or the degenerated planes), which decreases the programming speed, reduces the programming efficiency, and causes programming disturbance in the normal plane.

Therefore, there is a need to provide a memory device and its programming method that bypass certain planes such as the normal planes, such that the normal planes would not suffer from programming stress of unnecessary programming pulses.

SUMMARY OF THE INVENTION

It is therefore an objective of the present invention to provide a memory device and related programming method to eliminate programming disturbance.

The present invention discloses a programming method for a memory device. The programming method comprises simultaneously starting to program a first plane and a second plane; and bypassing the first plane and keeping programming the second plane when the first plane has been programmed successfully and the second plane has not been programmed successfully yet.

The present invention further discloses a memory device. The memory device comprises a first plane, a second plane, and a control circuit. The control circuit is configured to control the first plane and the second plane according to a programming method. The programming method comprises simultaneously starting to program a first plane and a second plane; and bypassing the first plane and keeping programming the second plane when the first plane has been programmed successfully and the second plane has not been programmed successfully yet.

These and other objectives of the present invention will no doubt become obvious to those of ordinary skill in the art after reading the following detailed description of the preferred embodiment that is illustrated in the various figures and drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a memory device according to an embodiment of the invention.

FIG. 2 is a schematic diagram of planes of the memory device shown in FIG. 1.

FIG. 3 is a flowchart of a programming method to program the memory device shown in FIG. 1 according to an embodiment of the present invention.

FIG. 4 is a schematic diagram illustrating a waveform of a programming voltage according to an embodiment of the present invention.

FIG. 5 is a flowchart of a programming method to program the memory device shown in FIG. 1 according to an embodiment of the present invention.

FIG. 6 is a schematic diagram of a selected circuit in the control circuit shown in FIG. 1 according to an embodiment of the present invention.

DETAILED DESCRIPTION

FIG. 1 is a block diagram of a memory device 10 according to an embodiment of the invention. The memory device 10 may have a dual-plane structure, and may include a control circuit 100, a word line driver 120, a plurality of bit line drivers 131, 132 and a plurality of planes (also referred to memory planes) 141, 142.

Briefly, the planes 141, 142 may be programmed and verified simultaneously. When the plane 141 (also referred to as first plane) has been programmed successfully but the plane 142 has not been programmed successfully yet, the plane 141 may be bypassed and the plane 142 (also referred to as second plane) may be still being programmed. By bypassing the plane 141 from subsequent programming once the plane 141 passes all verification, it reduces the time spent in an attempt to apply unnecessary programming pulses to the plane 141, and eliminates programming disturbance in the plane 141.

Please also refer to FIG. 2, which is a schematic diagram of the planes 141, 142 of the memory device 10 shown in FIG. 1. The plane 141 may be divided into a plurality of blocks 141B1 to 141Bi. Each of the blocks 141B1 to 141Bi includes a plurality of strings which may be NAND strings. Each string may include two select cells and a plurality of memory cells, which are connected in series, respectively, but is not limited thereto. The select cell disposed on a top of one string is configured for connecting the string to a plurality of bit lines BL11 to BL1 m and may be controlled by applying appropriate voltages to a string selection line SSL1. The select cell disposed at the bottom of one string is configured for connecting the string to a common source line CSL1 and may be controlled by applying appropriate voltages to a ground selection line GSL1. Control gates of the memory cells in the strings are connected to a plurality of word lines WL11 to WL1 n, respectively.

Similarly, the plane 142 may be divided into a plurality of blocks 142B1 to 142Bi. Each of the blocks 142B1 to 142Bi includes a plurality of strings which may be NAND strings. Each string may include two select cells and a plurality of memory cells, which are connected in series, respectively, but is not limited thereto. The select cell disposed on a top of one string is configured for connecting the string to a plurality of bit lines BL21 to BL2 m and may be controlled by applying appropriate voltages to a string selection line SSL2. The select cell disposed at the bottom of one string is configured for connecting the string to a common source line CSL2 and may be controlled by applying appropriate voltages to a ground selection line GSL2. Control gates of the memory cells in the strings are connected to a plurality of word lines WL21 to WL2 n, respectively.

As shown in FIG. 2, the planes 141, 142 have an identical structure (or a mirrored structure). While the dual-plane structure is used in the embodiment, it should be appreciated that other numbers of planes may also be adopted within the scope of the invention. Moreover, either a 2-dimensional planer memory structure, a 3-dimensional stacked structure, a NAND flash memory structure and/or a NOR flash memory structure may be implemented in the planes 141, 142. Each of the blocks 141B1 to 141Bi and 142B1 to 142Bi may be divided into a plurality of pages as indicated by dashed lines. In some embodiments, a block is the unit of conventional erase and a page is the unit of conventional program. However, other units of erase/program may be used as well. Typically, the bit lines BL11 to BL1 m or BL21 to BL2 m run on the top of the strings in a direction perpendicular to the word lines WL11 to WL1 n or WL21 to WL2 n, respectively, wherein i, m and n are integers larger than 1, but is not limited thereto.

Those skilled in the art would appreciate that the number of memory cells in one string does not limit the scope of the present invention. In addition, the memory cells in the strings may be floating-gate transistors or charge-trapping transistors. Each memory cell may store 1-bit data or two or more bits of data, and thus may be of a single-level cell (SLC) type, a multi-level cell (MLC) type, a triple-level cell (TLC) type, a quad-level cell (QLC) type, or a higher-level type. Each memory cell may hold one of Q possible programming states, where Q is a positive integer equal to or greater than 2, generally with Q=2 for an SLC, Q=4 for an MLC, Q=8 for a TLC, and Q=16 for a QLC.

The control circuit 100 may be coupled to the word line driver 120 and the bit line drivers 131, 132. The word line driver 120 may be coupled to the plane 141 via the string selection line SSL1, the word lines WL11 to WL1 n and the ground selection line GSL1. The word line driver 120 may be coupled to the plane 142 via the string selection line SSL2, the word lines WL21 to WL2 n and the ground selection line GSL2. The bit line driver 131 may be coupled to the plane 141 via the bit lines BL11 to BL1 m. The bit line driver 132 may be coupled to the plane 142 via bit lines BL21 to BL2 m. The array of memory cells in the plane 141 may be addressed by the word lines WL11 to WL1 n and the bit lines BL11 to BL1 m, and the array of memory cells in the plane 142 may be addressed by the word lines WL21 to WL2 n and the bit lines BL21 to BL2 m.

The control circuit 100 may be a controller, an embedded microprocessor, a microcontroller, or the like. The control circuit 100 may communicate with an external host to receive data for storage in the planes 141, 142 and to transmit data fetched from the planes 141, 142. The control circuit 100 may receive commands, addresses or data from the external host and generate bit line address signals Scadr1, Scadr2, and a word line address signal Sradr. The word line driver 120 may operate in response to the word line address signal Sradr from the control circuit 100 to select word lines for the read, program, erasure and verification operations. The bit line drivers 131, 132 may operate in response to the bit line address signals Scadr1, Scadr2 from the control circuit 100 to generate bit line signals to select bit lines for the read, program, erasure and verification operations. In some embodiments, the control circuit 100 includes voltage reference circuits for providing voltages for read, program, erasure and verification operations, and the bit line drivers 131, 132 and the word line driver 120 include switches for selecting a voltage. In other embodiments, the bit line drivers 131, 132 and the word line driver 120 include voltage generation circuitry and the control circuit 100 provides digital control information to instruct the bit line drivers 131, 132 and the word line driver 120 to drive various voltages on the bit lines BL11 to BL1 m, BL21 to BL2 m and the word lines WL11 to WL1 n, WL21 to WL2 n. However, the manner in which voltages are generated or routed to the bit lines BL11 to BL1 m, BL21 to BL2 m and the word lines WL11 to WL1 n, WL21 to WL2 n does not limit the scope of the present invention.

FIG. 3 is a flowchart of a programming method 30 to program the memory device 10 shown in FIG. 1 according to an embodiment of the present invention. The programming method 30 may be compiled into a program code. The method 30 may be performed by the control circuit 100, and include following steps:

Step S300: Start.

Step S302: Simultaneously start to program a first plane and a second plane.

Step S304: Bypass the first plane and keep programming the second plane when the first plane has been programmed successfully and the second plane has not been programmed successfully yet.

Step S306: End.

In step S302, the control circuit 100 simultaneously start to program two planes (for example, the planes 141, 142) or more than two planes of the memory device 10 so as to achieve multi-plane programming scheme in which two or more planes may be programmed and verified simultaneously. However, in step S302, the plane 141 is bypassed and the plane 142 is still being programmed when the plane 141 has been programmed successfully but the plane 142 has not been programmed successfully yet. By bypassing the plane 141 once the plane 141 pass all verification, programming disturbance may be eliminated.

For instance, the control circuit 100 may adopt an incremental step pulse programming (ISPP) scheme to program the planes 141, 142. Please refer to FIG. 4, which is a schematic diagram illustrating a waveform of a programming voltage according to an embodiment of the present invention. A plurality of programming pulses Vpp1 to Vpp6 may be applied to blocks at an increasing magnitude, and each successive programming pulse (for example, the programming pulse Vpp2) may exceed the immediately previous programming pulse (for example, the programming pulse Vpp1) by a programming step size. The programming step size may vary according to programming states or other requirements. The programming pulse Vpp1 may be applied to both the planes 141, 142 to start programming the planes 141, 142 simultaneously. On the other hand, if the block 141B1 has been programmed successfully before the programming pulse Vpp5 is applied, the block 141B1 may be subject to merely the programming pulses Vpp1 to Vpp4 but bypass the following programming pulses Vpp5, Vpp6. Consequently, the block 141B1 would not suffer from programming stress of the following unnecessary programming pulses Vpp5, Vpp6 while the block 142B1 are required to be programmed by more programming pulses (namely, the programming pulses Vpp5, Vpp6) and for longer time (because the number of programming pulses is larger), thereby eliminating or at least reducing programming disturbance in the block 141B1.

The block 141B1 may be programmed up to a first programming pulse count (equal to 4) corresponding to the programming pulses Vpp1 to Vpp4, and The block 142B1 may be programmed up to a second programming pulse count (equal to 6) corresponding to the programming pulses Vpp1 to Vpp6. The first programming pulse count is less than the second programming pulse counts. The block 142B1 may be programmed until a maximum programming pulse count Cpmax (also referred to as a predetermined programming pulse count) (for example, equal to 6) is reached. If the block 142B1 is still programmed unsuccessfully, the block 142B1 may be identified as a defective block. As the programming pulse Vpp6 is the last programming pulse corresponding to the maximum programming pulse count Cpmax, the control circuit 100 may stop programming the block 142B1. Although the control circuit 100 ends the programming of the (unsuccessfully-programmed or successfully-programmed) blocks 141B1, 142B1 non-simultaneously, the control circuit 100 start to program (first memory cells of) the block 141B2 followed by (third memory cells of) the block 141B1 and (second memory cells of) the block 142B2 followed by (fourth memory cells of) the block 142B2 simultaneously. A length of time from the start of programming the block 141B1 to the start of programming the block 141B2 depends on a length of time from the start of programming the block 142B1 to the start of programming the block 142B2. In other words, a length of time to programming two blocks (for example, the blocks 141B1, 142B1) is determined based on the block of a larger programming pulse count, which may be a defective block or a degenerated block, instead of the block of a smaller programming pulse count, which may be a normal block.

FIG. 5 is a flowchart of a programming method 50 to program the memory device 10 shown in FIG. 1 according to an embodiment of the present invention. The programming method 50 may be compiled into a program code. The method 50 may be performed by the control circuit 100, and include following steps:

Step S500: Start.

Step S502: Apply a programming pulse.

Step S504: Increase a programming pulse count Cp.

Step S506: Bypass at least one successfully-programmed plane.

Step S508: Determine whether all planes are bypassed. If yes, go to step S514; otherwise, go to step S510.

Step S510: Determine whether the programming pulse count Cp is less than the maximum programming pulse count Cpmax. If yes, go to step S502; otherwise, go to step S512.

Step S512: Indicate a programming failure.

Step S514: End.

Upon startup of a multi-plane programming, the planes 141, 142 are initialized for programming in step S500. The control circuit 100 sets a programming pulse count Cp and a verification count Cvf to a value such as 0 (namely, Cp=0, Cvf=0). In step S502, the control circuit 100 simultaneously starts to program the first memory cells of (the block 141B1 or a page of) the plane 141 and the second memory cells of (the block 142B1 or a page of) the second plane 142. The word line driver 120 may apply a programming pulse (for example, the programming pulse Vpp1) to selected word lines of the planes 141, 142. In step S504, the control circuit 100 increments the programming pulse count Cp by 1 (Cp=1).

Then, the control circuit 100 may verify whether the first memory cells of the plane 141 and the second memory cells or the plane 142 have been programmed successfully. In some embodiment, verify pulse(s) may be applied after each program pulse shown in FIG. 4 for verifying the threshold voltage of each memory cell. In some embodiment, the control circuit 100 may verify if the first memory cells and the second memory cells have reached one or more programming state(s). In some embodiment, data may be read from the first memory cells and the second memory cells on the selected bit lines, respectively. If data read is incorrect, the control circuit 100 may verify the respective first memory cells or the respective second memory cells as failed. If data read is correct, the control circuit 100 may verify the respective first memory cells or the respective second memory cells cell as passed. After the verification of the first memory cells and the second memory cells, the control circuit 100 increments the verification count Cvf by 1 (Cvf=1). In some embodiments, if more than a respective preset number of the first memory cells or the second memory cells have failed to reach one of the programming states, the control circuit 100 will verify the first memory cells or the second memory cells as failed. If less than a respective preset number of the first memory cells or the second memory cells have failed to reach the programming state(s), the control circuit 100 will verify the planes 141, 142 as passed. In some embodiments, if a number of the first memory cells or the second memory cells unable to be programmed successfully for each of the programming state(s) is less than a respective preset number, the first memory cells or the second memory cells are determined as passed.

To reduce programming disturbance, if any plane has been programmed successfully (and verified as passed), the control circuit 100 in step S506 bypasses the (successfully-programmed) plane(s) in the following programming. However, the control circuit 100 continues programming the other plane(s), which has yet to be programmed successfully in step S506. The control circuit 100 sets a suspension signal Sss1 to a logical low while maintaining a main signal Smn to the logical high to bypass the plane 141 and to continue the programming or the plane 142. By suspending the plane 141 once the plane 141 pass all verification, programming disturbance may be eliminated. In some embodiments, the plane 141 is suspended and the plane 142 are still being programmed when less than the preset number of the first memory cells has not been verified as passed yet but more than the preset number of the second memory cells has been verified as failed. The first memory cells of the plane 141 will be bypassed and preserved in the subsequent programming, while the second memory cells of the plane 142 will still be programmed in the subsequent programming. In other words, a first programming process for the first memory cells of the plane 141 and a second programming process for the second memory cells of the plane 142 are initiated simultaneously but end non-simultaneously. By suspending the plane 141 when the first memory cells of plane 141 are bypassed, programming disturbance in the plane 141 may be eliminated.

In step S508, the control circuit 100 determines whether all of the planes 141, 142 for the multi-plane programming scheme are bypassed. If all of the planes 141, 142 have been bypassed, the multi-plane programming scheme is completed. If any of the planes 141, 142 have not been suspended yet, the control circuit 100 determines whether the programming pulse count Cp is less than the maximum programming pulse count Cpmax in step S510. If the programming pulse count Cp (for example, Cp=1) is less than the maximum programming pulse count Cpmax (for example, Cpmax=6), the control circuit 100 iterates over Steps S402 to S408 until the programming pulse count Cp reaches the maximum programming pulse count Cpmax. For example, another programming pulse (for example, the programming pulse Vpp2, Vpp3, . . . , or Vpp6 in sequence) is applied to the selected word lines of the non-bypassed plane(s) in Step S502, and the control circuit 100 increments the programming pulse count Cp by 1 again in step S504.

If the first memory cells of the plain 141 is bypassed after the programming pulse Vpp4 is applied, the programming pulse count Cp increases to 4 to serve as a first programming pulse count. Besides, the verification count Cvf may be not less than 4 to serve as a first number of times for the first memory cells to be verified. Similarly, if the second memory cells of the plain 142 is bypassed after the programming pulse Vpp6 is applied, the programming pulse count Cp increases to 6 to serve as a second programming pulse count. Alternatively, if the second memory cells of the plain 142 cannot be successfully programmed (and may thus be disabled) after the last programming pulse (namely, the programming pulse Vpp6) is applied, the programming pulse count Cp also increases to 6, which is equal to the maximum programming pulse count Cpmax. In these cases, the verification count Cvf may be not less than 6 to serve as a second number of times for the second memory cells to be verified. The first programming pulse count corresponding to the first memory cells is less than the second programming pulse counts corresponding to the second memory cells. The first number of times for the first memory cells to be verified is less than the second number of times for the second memory cells to be verified.

Since the first memory cells has been programmed successfully before the programming pulse Vpp5 is applied, the first memory cells may be subject to merely the programming pulses Vpp1 to Vpp4 but bypass the following programming pulses Vpp5, Vpp6. Consequently, the first memory cells would not suffer from programming stress of the following programming pulses Vpp5, Vpp6 while the second memory cells are required to be programmed by more programming pulses Vpp5, Vpp6 for longer time, thereby eliminating or at least reducing programming disturbance in the block 141B1.

If the programming pulse count Cp (or the second programming pulse count) is equal to or larger than the maximum programming pulse count Cpmax, a programming failure report is transmitted to the control circuit 100 in step S512 so as to report a programming failure for non-bypassed plane(s) (for example, the plane 142) if there is any. In other words, the second memory cells may be programmed until the maximum programming pulse count Cpmax is reached. In some embodiments, when the programming pulse count Cp (or the second programming pulse count) is equal to the maximum programming pulse count Cpmax, the control circuit 100 may stop programming the second memory cells.

It is noteworthy that those skilled in the art may readily make different alternations and modifications. For instance, to bypass (the first memory cells of) the plane 141, a plane selection signal or a block selection signal may be blocked. Alternatively, all the word lines WL21 to WL2 n or all the bit lines BL11 to BL1 m of the plane 141 is deselected to bypass (the first memory cells of) the plane 141. FIG. 6 is a schematic diagram of a selected circuit in the control circuit 100 shown in FIG. 1 according to an embodiment of the present invention. The control circuit 100 may include AND gates 101 and 102 to control access to the planes 141 and 142, respectively. The AND gate 101 may receive a plane address signal Spr1, a disable signal Sdb1, the main signal Smn, or the suspension signal Sss1 to generate a plane selection signal Ssp1. The AND gate 102 may receive a plane address signal Spr2, a disable signal Sdb2, the main signal Smn, or a suspension signal Sss2 to generate a plane selection signal Ssp2. In some embodiments, the control circuit 100 may set the main signal Smn to a logical high to continue programming of the memory device 10, and set the main signal Smn to a logical low to cease programming of the memory device 10. In some embodiments, the control circuit 100 may generate the disable signal Sdb1, Sdb2 when a programming failure report, which may indicate a programming result upon exiting program-verification operation(s), is received. In some embodiments, the suspension signals Sss1, Sss2 may indicate whether verification result(s) are passed or failed.

In some embodiments, the disable signal Sdb1, Sdb2 may be associated with a programming state counter, the verification count Cvf, the programming pulse count Cp, or the maximum programming pulse count Cpmax. The maximum programming pulse count Cpmax may define the maximum number of times to apply programming pulses to the planes 141, 142. The programming state counter may be associated with target programming states or current programming states. Specifically, the first memory cells and the second memory cells may be initially set in the erase state, and later, a series of program-verification operations may be performed on the first memory cells and the second memory cells to program the first memory cells and the second memory cells into respective target programming states. The series of program-verification operations may start from the lowest programming state and proceed to higher programming states until the threshold voltages of selected memory cells reach respective verification voltage levels of respective target programming states. In some embodiments, the verification voltages may be selected as the minimum threshold voltages of threshold voltage distribution curves of the programming states, respectively. Each program-verification operation may include a programming operation and a subsequent verification operation.

The control circuit 100 may generate the bit line address signal Scadr1 according to the plane selection signal Ssp1, generate the bit line address signal Scadr2 according to the plane selection signal Ssp2, and generate the word line address signal Sradr according to the plane selection signals Ssp1, Ssp2. In some embodiments, when it is determined to suspend the plane 141, the control circuit 100 may set the suspension signal Sss1 a logical low, the AND gate 101 may block the plane selection signal Ssp1 in response to the suspension signal Sss1 by setting the plane selection signal Ssp1 to a logical low, and the control circuit 100 may generate the word line address signal Sradr and the bit line address signal Scadr1 to deselect the word lines WL11 to WL1 n and the bit lines BL11 to BL1 m of the plane 141. Likewise, when it is determined to suspend the plane 142, the control circuit 100 may set the suspension signal Sss2 to a logical low, the AND gate 102 may block the plane selection signal Ssp2 in response to the suspension signal Sss2 by setting the plane selection signal Ssp2 to a logical low, and the control circuit 100 may generate the word line address signal Sradr and the bit line address signal Scadr2 to deselect the word lines WL21 to WL2 n and the bit lines BL21 to BL2 m of the plane 142. For instance, the word lines WL11 to WL1 n, WL21 to WL2 n or the bit lines BL11 to BL1 m, BL21 to BL2 m may be put in a floating state, be subjected to a low voltage, or be grounded so as to deselect the word lines WL11 to WL1 n, WL21 to WL2 n or the bit lines BL11 to BL1 m, BL21 to BL2 m.

In some embodiments, the AND gate 101 may receive a first block address signal in place of the plane address signal Spr1 to generate a first block selection signal (to replace the plane selection signal Ssp1), and the AND gate 102 may receive a second block address signal in place of the plane address signal Spr2 to generate a second block selection signal (to replace the plane selection signal Ssp2). The control circuit 100 may generate the bit line address signal Scadr1 according to the first block selection signal, generate the bit line address signal Scadr2 according to the second block selection signal, and generate the word line address signal Sradr according to the first block selection signal and the second block selection signal. In some embodiments, when it is determined to suspend the block 141B1, the control circuit 100 may set the suspension signal Sss1 to a logical low, the AND gate 101 may block the first block selection signal in response to the suspension signal Sss1 by setting the first block selection signal to a logical low, and the control circuit 100 may generate the word line address signal Sradr and the bit line address signal Scadr1 to deselect the word lines WL11 to WL1 n and the bit lines BL11 to BL1 m of the plane 141. Likewise, when it is determined to suspend the block 142B1, the control circuit 100 may set the suspension signal Sss2 to a logical low, the AND gate 102 may block the second block selection signal in response to the suspension signal Sss2 by setting the second block selection signal to a logical low, and the control circuit 100 may generate the word line address signal Sradr and the bit line address signal Scadr2 to deselect the word lines WL21 to WL2 n and the bit lines BL21 to BL2 m of the plane 142.

In summary, the present invention simultaneously programs at least two planes of a memory device so as to achieve the multi-plane programming scheme. At least one plane is bypassed and the other plane(s) are still being programmed when the at least one plane has been programmed successfully but the other plane(s) have not been programmed successfully yet. By bypassing the at least one plane once the at least one plane pass all verification, programming disturbance in the at least one plane may be eliminated.

Those skilled in the art will readily observe that numerous modifications and alterations of the device and method may be made while retaining the teachings of the invention. Accordingly, the above disclosure should be construed as limited only by the metes and bounds of the appended claims. 

What is claimed is:
 1. A programming method for a memory device, the programming method comprising: simultaneously starting to program a plurality of planes, wherein the plurality of planes comprises a first plane and a second plane; and bypassing the first plane and keeping programming the second plane when the first plane has been programmed successfully and the second plane has not been programmed successfully yet, wherein successfully-programmed planes of the plurality of planes are bypassed and others of the plurality of planes are kept being programmed.
 2. The programming method of claim 1, further comprising: simultaneously starting to program a plurality of first memory cells of the first plane and a plurality of second memory cells of the second plane; and bypassing the plurality of first memory cells and keeping programming the plurality of second memory cells when less than a preset number of the plurality of first memory cells has not been programmed successfully yet and more than the preset number of the plurality of second memory cells has not been programmed successfully yet.
 3. The programming method of claim 2, wherein a first programming process for the plurality of first memory cells and a second programming process for the plurality of second memory cells are initiated simultaneously but end non-simultaneously.
 4. The programming method of claim 3, further comprising: simultaneously starting to program a plurality of third memory cells of the first plane and a plurality of fourth memory cells of the second plane after the first programming process and the second programming process are finished, wherein the plurality of first memory cells are followed by the plurality of third memory cells, wherein the plurality of second memory cells are followed by the plurality of fourth memory cells.
 5. The programming method of claim 2, wherein the plurality of first memory cells corresponds to a first programming pulse count, wherein the plurality of second memory cells of the second block corresponds to a second programming pulse count, wherein the first programming pulse count is less than the second programming pulse counts.
 6. The programming method of claim 5, further comprising: reporting a programming failure for the second plane when the second programming pulse count is larger than a predetermined programming pulse count.
 7. The programming method of claim 2, further comprising: verifying whether the plurality of first memory cells and the plurality of second memory cells have been programmed successfully, wherein a first number of times for the plurality of first memory cells to be verified is less than a second number of times for the plurality of second memory cells to be verified.
 8. The programming method of claim 2, wherein the first plane is suspended when the plurality of first memory cells are bypassed.
 9. The programming method of claim 1, wherein the step of bypassing the first plane comprises: blocking a plane selection signal; blocking a block selection signal; deselecting all word lines of the first plane; or deselecting all bit lines of the first plane.
 10. A memory device, comprising: a first plane; a second plane; and a control circuit, configured to control the first plane and the second plane according to a programming method, wherein the programming method comprises: simultaneously starting to program a plurality of planes, wherein the plurality of planes comprises a first plane and a second plane; and bypassing the first plane and keeping programming the second plane when the first plane has been programmed successfully and the second plane has not been programmed successfully yet, wherein successfully-programmed planes of the plurality of planes are bypassed and others of the plurality of planes are kept being programmed.
 11. The memory device of claim 10, wherein the programming method further comprising: simultaneously starting to program a plurality of first memory cells of the first plane and a plurality of second memory cells of the second plane; and bypassing the plurality of first memory cells and keeping programming the plurality of second memory cells when less than a preset number of the plurality of first memory cells has not been programmed successfully yet and more than the preset number of the plurality of second memory cells has not been programmed successfully yet.
 12. The memory device of claim 11, wherein a first programming process for the plurality of first memory cells and a second programming process for the plurality of second memory cells are initiated simultaneously but end non-simultaneously.
 13. The memory device of claim 12, wherein the programming method further comprising: simultaneously starting to program a plurality of third memory cells of the first plane and a plurality of fourth memory cells of the second plane after the first programming process and the second programming process are finished, wherein the plurality of first memory cells is followed by the plurality of third memory cells, wherein the plurality of second memory cells is followed by the plurality of fourth memory cells.
 14. The memory device of claim 11, wherein the plurality of first memory cells corresponds to a first programming pulse count, wherein the plurality of second memory cells of the second block corresponds to a second programming pulse count, wherein the first programming pulse count is less than the second programming pulse counts.
 15. The memory device of claim 14, wherein the programming method further comprising: reporting a programming failure for the second plane when the second programming pulse count is larger than a predetermined programming pulse count.
 16. The memory device of claim 11, wherein the programming method further comprising: verifying whether the plurality of first memory cells and the plurality of second memory cells have been programmed successfully, wherein a first number of times for the plurality of first memory cells to be verified is less than a second number of times for the plurality of second memory cells to be verified.
 17. The memory device of claim 11, wherein the first plane is suspended when the plurality of first memory cells are bypassed.
 18. The memory device of claim 10, wherein the step of bypassing the first plane comprises: blocking a plane selection signal; blocking a block selection signal; deselecting all word lines of the first plane; or deselecting all bit lines of the first plane. 